Three Reasons to Adopt TAG-Based Surface Realisation
نویسندگان
چکیده
Surface realisation from flat semantic formulae is known to be exponential in the length of the input. In this paper, we argue that TAG naturally supports the integration of three main ways of reducing complexity: polarity filtering, delayed adjunction and empty semantic items elimination. We support these claims by presenting some preliminary results of the TAG-based surface realiser GenI.
منابع مشابه
RTG based surface realisation for TAG
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based Tree Adjoining Grammar (FTAG) which draws on the observation that an FTAG can be translated into a Regular Tree Grammar describing its derivation trees. We carry out an extensive testing of several variants of this algo...
متن کاملSynthetics of NiFe2O4 nanoparticles for recombinant His-tag protein purification
Recombinant protein purification is a kind of sensitive and expensive method in genetics engineering. Genetic manipulation leads to the expression of various proteins; it should be isolated with high purity finally. Differed methods for protein purification are categorized, based on cast, quality, Easy work and side effect of protein. In this article, we are investigating his His-tag protein pu...
متن کاملSynthetics of NiFe2O4 nanoparticles for recombinant His-tag protein purification
Recombinant protein purification is a kind of sensitive and expensive method in genetics engineering. Genetic manipulation leads to the expression of various proteins; it should be isolated with high purity finally. Differed methods for protein purification are categorized, based on cast, quality, Easy work and side effect of protein. In this article, we are investigating his His-tag protein pu...
متن کاملSurface Realisation from Knowledge-Bases
We present a simple, data-driven approach to generation from knowledge bases (KB). A key feature of this approach is that grammar induction is driven by the extended domain of locality principle of TAG (Tree Adjoining Grammar); and that it takes into account both syntactic and semantic information. The resulting extracted TAG includes a unification based semantics and can be used by an existing...
متن کاملGenerating and Selecting Grammatical Paraphrases
Natural language has a high paraphrastic power yet not all paraphrases are appropriate for all contexts. In this paper, we present a TAG based surface realiser which supports both the generation and the selection of paraphrases. To deal with the combinarial explosion typical of such an NP-complete task, we introduce a number of new optimisations in a tabular, bottom-up surface realisation algor...
متن کامل